Utilitiy Accrual Scheduling with Real-Time Java
نویسندگان
چکیده
Graceful performance degradation during overload conditions is the primary objective of soft real-time systems. Utility accrual soft real-time scheduling algorithms allow speci cation of highly customized temporal system behavior during overload. Such algorithms are typically found in realtime supervisory systems where signi cant run-time uncertainty exists. This paper outlines an investigation of several utility accrual scheduling algorithms implemented in a Real-Time Java (RTJ) environment. These alternate schedulers are constructed, tested, and evaluated under the MIT FLEX/RTJ Compiler Infrastructure. The scheduling framework for this environment and its associated scheduling primitives are described and the corresponding performance characteristics are pro led. Furthermore, we outline the architecture of an experimental distributed Real-time Java scheduler.
منابع مشابه
Java Garbage Collection Scheduling in Utility Accrual Scheduling Environments
Convenience, reliability, and effectiveness of automatic memory management have long been established in modern systems and programming languages such as Java. The timeliness requirements of real-time systems, however, impose specific demands on the operational parameters of the garbage collector. The memory requirements of real-time tasks must be accommodated with a predictable impact on the t...
متن کاملGarbage Collection Scheduling for Utility Accrual Real-Time Systems
Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU overload, this dissertation explores memory overload conditions during which the aggregate memory demand e...
متن کاملOn Scheduling Exception Handlers in Dynamic Real-Time Systems
We consider the problem of scheduling exception handlers in real-time systems that operate under runtime uncertainties including those on execution times, activity arrivals, and failure occurrences. The application/scheduling model includes activities and their exception handlers that are subject to time/utility function (TUF) time constraints and an utility accrual (UA) optimality criterion. A...
متن کاملConsensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate a consensus utility accrual scheduling algorithm for distributable threads with run-time uncertainties in execution time, arrival models, and node crash failures. The DUA-CLA algorithm’s message complexity (O(fn)), lower time complexity bound (O(D+fd+nk)), and failure-free execution time (O(D+ nk)) are established, where D is the worst-case communication delay, d is the failure d...
متن کاملOptimal Time Utility Based Scheduling Policy Design for Cyber-Physical Systems
Classical scheduling abstractions such as deadlines and priorities do not readily capture the complex timing semantics found in many real-time cyber-physical systems. Time utility functions provide a necessarily richer description of timing semantics, but designing utility-aware scheduling policies using them is an open research problem. In particular, optimal utility accrual scheduling design ...
متن کامل